Nonstandard Methods in Ramsey’s Theorem for Pairs

نویسنده

  • C. T. CHONG
چکیده

We discuss the use of nonstandard methods in the study of Ramsey type problems, and illustrate this with an example concerning the existence of definable solutions in models of BΣ2 for the combinatorial principles of Ramsey’s Theorem for pairs and cohesiveness.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nonstandard Models in Recursion Theory and Reverse Mathematics

We give a survey of the study of nonstandard models in recursion theory and reverse mathematics. We discuss the key notions and techniques in effective computability in nonstandard models, and their applications to problems concerning combinatorial principles in subsystems of second order arithmetic. Particular attention is given to principles related to Ramsey’s Theorem for Pairs.

متن کامل

The polarized Ramsey's theorem

We study the effective and proof-theoretic content of the polarized Ramsey’s theorem, a variant of Ramsey’s theorem obtained by relaxing the definition of homogeneous set. Our investigation yields a new characterization of Ramsey’s theorem in all exponents, and produces several combinatorial principles which, modulo bounding for Σ2 formulas, lie (possibly not strictly) between Ramsey’s theorem ...

متن کامل

The Metamathematics of Stable Ramsey’s Theorem for Pairs

We show that, over the base theory RCA0, Stable Ramsey’s Theorem for Pairs implies neither Ramsey’s Theorem for Pairs nor Σ2-induction.

متن کامل

The Inductive Strength of Ramsey’s Theorem for Pairs

We address the question, “Which number theoretic statements can be proven by computational means and applications of Ramsey’s Theorem for Pairs?” We show that, over the base theory RCA0, Ramsey’s Theorem for Pairs does not imply Σ2-induction.

متن کامل

The strength of the rainbow Ramsey Theorem

The Rainbow Ramsey Theorem is essentially an “anti-Ramsey” theorem which states that certain types of colorings must be injective on a large subset (rather than constant on a large subset). Surprisingly, this version follows easily from Ramsey’s Theorem, even in the weak system RCA0 of reverse mathematics. We answer the question of the converse implication for pairs, showing that the Rainbow Ra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006